Efficient TBox Subsumption Checking in Combinations of EL and (fragments of) FL0
نویسندگان
چکیده
We study possibilities of combining (fragments) of the lightweight description logics FL0 and EL, and identify classes of subsumption problems in a combination of EL and Horn-FL0, which can be checked in PSPACE resp. PTIME. Since FL0 allows universal role restrictions and EL allows existential role restrictions, we thus have a framework where subsumption between expressions including both types of role restrictions (but for disjoint sets of roles) can be checked in polynomial space or time.
منابع مشابه
Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics
While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the EL family of description logics; here, efficient reasoning is based on satisfaction checking in suitable small models that characterize formulas in terms of...
متن کاملPushing the EL Envelope
Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already intractable in the presence of acyclic TBoxes, it remains tractable in EL even with general concept ...
متن کاملData Complexity of Instance Checking in The EL Family of Description Logics
Subsumption in the description logic (DL) EL is known to be tractable even when it is done with respect to the most general form of terminology, namely a set of general inclusion axioms (GCIs). Recently, this tractability boundary has been clarified by identifying DL constructors that causes intractability of subsumption when added to EL and that do not. These results provide us with a characte...
متن کاملLocality and Applications to Subsumption Testing in EL and Some of its Extensions
In this paper we show that subsumption problems in the description logics EL and EL can be expressed as uniform word problems in classes of semilattices with monotone operators. We use possibilities of efficient local reasoning in such classes of algebras, to obtain uniform PTIME decision procedures for TBox and CBox subsumption in EL and EL. These locality considerations allow us to present a ...
متن کاملOn P/NP Dichotomies for EL Subsumption under Relational Constraints
We consider the problem of characterising relational constraints under which TBox reasoning in EL is tractable. We obtain P vs. coNP-hardness dichotomies for tabular constraints and constraints imposed on a single reflexive role.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011